A linear kernel for planar red-blue dominating set
نویسندگان
چکیده
In the Red-Blue Dominating Set problem, we are given a bipartite graph G = (VB ∪ VR, E) and an integer k, and asked whether G has a subset D ⊆ VB of at most k ‘blue’ vertices such that each ‘red’ vertex from VR is adjacent to a vertex in D. We provide the first explicit linear kernel for this problem on planar graphs.
منابع مشابه
A bounded search tree algorithm for parameterized face cover
The parameterized complexity of the FACE COVER problem is considered. The input to this problem is a plane graph G with n vertices. The question asked is whether, for a given parameter value k, there exists a set of k or fewer faces whose boundaries collectively cover (contain) every vertex in G. Early attempts achieved run times of O∗(12k) or worse, by reducing the problem into a special form ...
متن کاملPolynomial Kernels for Hard Problems on Disk Graphs
Kernelization is a powerful tool to obtain fixed-parameter tractable algorithms. Recent breakthroughs show that many graph problems admit small polynomial kernels when restricted to sparse graph classes such as planar graphs, bounded-genus graphs or H-minor-free graphs. We consider the intersection graphs of (unit) disks in the plane, which can be arbitrarily dense but do exhibit some geometric...
متن کاملA linear kernel for planar total dominating set
A total dominating set of a graph G = (V,E) is a subset D ⊆ V such that every vertex in V is adjacent to some vertex in D. Finding a total dominating set of minimum size is NPcomplete on planar graphs and W [2]-complete on general graphs when parameterized by the solution size. By the meta-theorem of Bodlaender et al. [FOCS 2009], it follows that there exists a linear kernel for Total Dominatin...
متن کاملLinear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs
We present a linear-time kernelization algorithm that transforms a given planar graph G with domination number γ(G) into a planar graph G′ of size O(γ(G)) with γ(G) = γ(G′). In addition, a minimum dominating set for G can be inferred from a minimum dominating set for G′. In terms of parameterized algorithmics, this implies a linear-size problem kernel for the NP-hard Dominating Set problem on p...
متن کاملLinear Kernel for Planar Connected Dominating Set
We provide polynomial time data reduction rules for Connected Dominating Set in planar graphs and analyze these to obtain a linear kernel for the planar Connected Dominating Set problem. To obtain the desired kernel we introduce a method that we call reduce or refine. Our kernelization algorithm analyzes the input graph and either finds an appropriate reduction rule that can be applied, or zoom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 217 شماره
صفحات -
تاریخ انتشار 2013